#include <bits/stdc++.h>
using namespace std;
const int N=1e5;
int n,r[N+5];
queue<int> q;
signed main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	cin>>n;
	for (int i=1;i<=n;i++){
		scanf("%d",&r[i]);
	}
	sort(r+1,r+n+1);
	q.push(r[1]);
	for (int i=2;i<=n;i++){
		if (r[i]>q.front()){
			q.pop();
		}
		q.push(r[i]);
	}
	cout<<q.size();
	return 0;
}
